perm filename S224[224,DBL] blob
sn#094726 filedate 1974-04-08 generic text, type T, neo UTF8
00100 STANFORD UNIVERSITY 1
00200 COMPUTER SCIENCE DEPARTMENT
00300 SPRING, 1974
00400
00500 MODELS OF THOUGHT PROCESSES
00600 (artificial intelligence)
00700 CS 224
00800 T Th 1:15-2:30, Room 300
00900
01000 Handout #1 April 2, 1974
01100
01200 Fact Sheet
01300
01400 Instructor: Cordell Green
01500 Office: Polya 258
01600 Office Hours: 2:30-3:30 Th
01700
01800 Teaching Assistant: Doug Lenat
01900 Office: Polya 263 ext: 4946
02000 Office Hours: 11-12, 1:30-3 W
02100 12-1 Th
02200
02300 Purpose:
02400 A commonly held belief is that computer scientists are convinced
02500 that people are really machines. Thus the purpose of this course is to
02600 program you not to believe that we think of you as a machine.
02700
02800 Requirements:
02900
03000 1. There will be two textbooks:
03100
03200 Nilsson, N. J. (1971) Problem-Solving Methods in Artificial Intelligence.
03300 New York: McGraw-Hill.
03400
03500 Schank, R. and Colby, K. (1973) Computer Models of Thought and
03600 Language. Freeman & Co. Note: only chapters 1,4,5,6 required.
03700
03800
03900 2. The Class Notes for CS 224 (Spring, 1974) are required reading.
04000 These are a collection of reprints of recent articles.
04100
04200 3. Since the cost of these 3 items is substantial (about $25 total),
04300 copies will remain on reserve in the Computer Science Library,
04400 located in Polya Hall.
04500
04600 4. Despite some clerical errors in the time schedule, CS 224 is a
04700 two (2) credit course.
00100 Contents of "CS 224 Class Notes (Spring, 1974)"
00200
00300 PAGE ARTICLE
00400
00500 1 Falk, G. (1972) Interpretation of Imperfect Line Data as a
00600 Three-dimensional Scene; in The Artificial Intelligence
00700 Journal (Summer, 1972) Vol. 3, pp. 101-144.
00800
00900 24 Feigenbaum, E. et al (1971) On Generality and Problem Solving:
01000 A Case Study Using The DENDRAL Program. (eds Meltzer and
01100 Michie) Machine Intelligence 6, pp 165-190.
01200
01300 38 Fikes, R. E. et al (1972) Learning and Executing Generalized
01400 Robot Plans. Artificial Intelligece, Vol. 3 (Winter 1972).
01500
01600 58 Minsky, M. and Papert, S.(1972) Artificial Intelligence Progress
01700 Report. MIT Project MAC, AI Memo 252.
01800
01900 107 Newell, Barnett, Forgie, Green, Licklider, Munson, Reddy, and
02000 Woods (1971) Speech Understanding Systems: Final Report of a
02100 Study Group. Carnegie-Mellon University: Computer Science
02200 Department. Chaps. 1,4; Appendix A2.
02300
02400 119 Reddy, D. Raj, Erman, Fennell, Neely (1973) The HEARSAY Speech
02500 Understanding System: An Example of The Recognition Process.
02600 Third IJCAI, pp. 185-193.
02700
02800 128 McCarthy, J. and Hayes, P. (1969) Some Philosophical Problems from
02900 The Standpoint of AI. Machine Intelligence 4 (eds Meltzer
03000 and Michie) pp. 463-502. Edinburgh University Press.
03100
03200 145 Simon, H (1973) Lessons from Perception for Chess-Playing Programs
03300 (and vice versa), CMU Computer Science Research Review
03400 1972-1973, pp. 35-40.
03500
03600 149 Winston, P. H. (1972) The M.I.T. Robot,
03700 Machine Intelligence 7, American Elsevier Pub.,
03800 pp. 437-442 only. ←←←← note carefully
03900
04000 153 Woods, W. A. and Makhoul, J. (1973) Mechnical Inference Problems
04100 in Continuous Speech Understanding. Third IJCAI, pp. 200-207.
04200
04300 161 Nilsson, N. J. (1974) Artificial Intelligence (an overview)
04400 SRI Technical Note 89 (March, 1974), and also
04500 IFIP Congress 74 (Sweden, August, 1974).
04600 Note: since this is our first reading, it was handed
04700 out separately; it is not bound into the notes.
00100 Supplementary Reading List: 3
00200
00300 Agin, G. and Binford, T. (1973) Computer Description of Curved
00400 Objects. Third Internatonal Joint Conference
00500 on Artificial Intelligence, Advanced Papers pp 629-640.
00600
00700 Chandrasekharan and Reeker (1974) AI: A Case for Agnosticism, in
00800 IEEE Transactions on Systems, Man, and Cybernetics;
00900 January, 1974, pp. 88-94.
01000
01100 Dreyfus, H. (1972) What Computers Can't Do. Harper & Row.
01200
01300 Firschein, O., and Coles, S. (1973) Forecasting and Assessing The
01400 Impact of Artificial Intelligence on Society. 3rd IJCAI; 105-120
01500
01600 Hunt (1974) Artificial Intelligence, Parts 1,2. U. of Washington.
01700
01800 Lighthill, Sir J., and Sutherland, Needham, Longuet-Higgins, and
01900 Michie (1973) AI: A Paper Symposium; by the British Science
02000 Research Council, April, 1973. A pro/con AI debate.
02100
02200 MIT AI Memo 299 (1974) ARPA Proposal on Intelligent Automata and
02300 Micro-automation. Will become available sometime during term.
02400
02500 Newell, A., and Moore, J. (1973) How Can MERLIN Understand?
02600 Carnegie Mellon University, Computer Science Report,
02700 Nov. 15, 1973.
02800
02900 Newell, A. (1965) Limitations of The Current Stock of Ideas about
03000 Problem:Solving. Proceedings of a Conference on Electronic
03100 Information Handling, pp. 195-208. (eds Kent and Taulbee)
03200 New York: Spartan.
03300
03400 Newell, A. (1969) Heuristic Programming: Ill-Structured Problems,
03500 in (ed. Aronofsky, A.) Progress in Operations Research III,
03600 John WIley and Sons.
03700
03800 Newell, A. (1970) Remarks on The Relationship Between AI and
03900 Cognitive Psychology, in (Banerji and Mesarovic, eds.)
04000 Theoretical Approaches to Non-Numerical Problem Solving,
04100 pp 363-400. New York: Springer-Verlag Pub.
04200
04300 Reddy, Erman, and Neely (1973) A Model and a System for Machine
04400 Recognition of Speech. IEEE Transactons, Audio and
04500 Electrostatics, Autumn, 21 (3) , June, 1973.
04600
04700 Slagle, J. R. (1971) Artificial Intelligence: The Heuristic Programming
04800 Approach. New York: McGraw Hill.
04900
05000 Winograd, T. (1971) Procedures as a Representation for Data in a
05100 Computer Program for Understanding Natural Language.
05200 Ph. D. Thesis, M.I.T.
05300
05400 Yakimovsky, Y. and Feldman, J. (1973) A Semantics-Based Decision
05500 Theory Region Analyzer. Third IJCAI, Advanced Papers pp 580-8.
05600
05700 In addition, you might want to look over some of these materials:
05800 Proceedings of the 1st, 2nd, 3rd IJCAI's (1969,1971,1973)
05900 Machine Intelligence n (n=1,2,3,4,5,6,7)
06000 Artificial Intelligence Journal
06100 SIGART (ACM Special Interest Group in AI issues these journals)
00100 Schedule of Lectures (Tentative) 4
00200
00300 Lec. Date Topic Speaker
00400
00500
00600 1. April 2 Introduction Green
00700 2. April 4 Problem Representation Green
00800
00900 3. April 9 Problem Space Searching Nilsson
01000 4. April 11 Problem Reduction Nilsson
01100
01200 5. April 16 Automatic Theorem-proving Luckham
01300 6. April 18 Formal Representation McCarthy
01400
01500 7. April 23 Human Memory Feigenbaum
01600 8. April 25 Human Problem-Solving Feigenbaum
01700
01800 9. April 30 Natural Language Processing Winograd
01900 10. May 2 Natural Language Processing Winograd
02000
02100 11. May 7 Speech Understanding Systems Reddy
02200 12. May 9 Learning, Planning, STRIPS Fikes
02300
02400 13. May 14 Vision and Robotics Feldman/Binford
02500 14. May 16 Vision and Robotics Feldman
02600
02700 15. May 21 Computer Simulation of Paranoia Colby
02800 16. May 23 New Languages for AI Research Bobrow
02900
03000 17. May 28 Heuristic DENDRAL and Other AI Applications Buchanan
03100 18. May 30 "Induction" Programs Buchanan
03200
03300 19. June 4 Automatic Programming Green
03400 20. June 6 Review
00100 Schedule of Reading Assignments (Tentative) 5
00200
00300
00400 Lec. Date Assignment Speaker
00500
00600 1. April 2| |Nilsson, Chap. 1,2,3.1-3.3; Green
00700 2. April 4| |Classnotes, pp. 161-193 (Nilsson's Overview) Green
00800
00900 3. April 9| |Nilsson, Chap. 3,4,5 (optional: 3.8,3.9,5.8) Nilsson
01000 4.April 11| |Classnotes, pp. 58-106 (MIT report) Nilsson
01100
01200 5. April 16 Nilsson, Chap. 6,7 (just scan 6.7-6.13, Luckham
01300 6.15,7.3,7.4, and scan all of Chap. 8)
01400 6. April 18 Classnotes, pp. 128-144 (McCarthy & Hayes) McCarthy
01500
01600 7. April 23| |Schank and Colby, Chap. 1 Feigenbaum
01700 8. April 25| |Classnotes, pp. 145-148 (Simon) Feigenbaum
01800
01900 9. April 30| |Schank and Colby, Chap. 4,5 Winograd
02000 10. May 2 | | Winograd
02100
02200 11. May 7 Classnotes, pp. 107-127(Newell,Reddy) Reddy
02300 also, Classnotes, pp. 153-160 (Woods)
02400 12. May 9 Classnotes, pp. 38-57 (Fikes) Fikes
02500
02600 13. May 14| |Classnotes, pp. 1-23 (Falk) and Feldman/Binford
02700 14. May 16| | pp. 149-152 (Winston) Feldman
02800
02900 15. May 21 Schank and Colby, Chap. 6 Colby
03000 16. May 23 Bobrow
03100
03200 17. May 28| |Classnotes, pp. 24-37 (Feigenbaum) Buchanan
03300 18. May 30| | Buchanan
03400
03500 19. June 4 Green
03600 20. June 6
03700
03800 Note: vertical bars indicate that the assignment is for the week;
03900 absence of bars means it is for that one particular lecture.
00100 CS 224 Homework #1 (part of Handout #1) 6
00200 April 2, 1974
00300 Due: Tuesday, April 9, 1974
00400
00500 You should have read at least Chapter 1 of Nilsson's book before
00600 doing this.
00700
00800 You are to do precisely one (1) problem out of the following three.
00900 If you have never read any of Newell's work on cryptarithmetic, do (A).
01000 If you have read something about this, do either (B) or (C) instead.
01100
01200 A.) The following puzzle is called a crypt-arithmetic problem:
01300
01400 DONALD
01500 + GERALD D ← 5
01600 ________
01700 ROBERT
01800 Each letter assigned to exactly one digit.
01900 Each digit assignd to exactly one letter.
02000
02100 Each letter is to be assigned a distinct digit between 0 and 9 such that
02200 when the letters are replaced by their assigned digits, a correct sum is
02300 obtained. As a starter, it is given that D is 5. This means that every
02400 occurrence of D (there are three of them) should be replaced by a 5, and
02500 also that no other letter can be assigned the digit 5.
02600
02700 Without reading Newell's paper, think about how the above problem might
02800 be represented in terms of problem states and operators.
02900
03000 Describe your representation: What are the states? the operators?
03100
03200 Explore the possibility of better search (or no-search) methods.
03300 Explore the possibility of better representations.
03400
03500 Guideline: We don't expect the "ultimate" answer; just give us some
03600 evidence that you've thought about this problem.
03700
03800
03900 B.) Problem 2.4 in Nilsson's book
04000 C.) Problem 2.7 in Nilsson's book (note: Nilsson gives this problem
04100 "term project" rating of difficulty)
00100 CS 224 Questionnaire 7
00200
00300 Name _____________________________
00400
00500 Taking course for: Grade ___ Pass/NoCredit ___ Audit ___
00600
00700 Status: Freshman ___ Soph ___ Jr ___ Sr ___ 1st yr. grad. ___
00800
00900 2nd yr. grad. ___ 3rd yr. grad. ___
01000
01100 Undergrad. Major __________________
01200
01300 Grad. Major ______________________
01400
01500 Probable Area of Specialization _____________________________________
01600
01700 ____________________________________________________________
01800
01900
02000 Please rate your knowledge of the following subjects:
02100
02200 None Not Much Some Lots
02300 ____ ________ ____ ____
02400
02500 Programming_______________________________________________________
02600 List-Processing___________________________________________________
02700 Psychology________________________________________________________
02800 Human Problem Solving_____________________________________________
02900 Newell's book & papers____________________________________________
03000 Linguistics_______________________________________________________
03100 Artificial Intelligence___________________________________________
03200 Game-Playing Programs_____________________________________________
03300 Formal Logic______________________________________________________
03400
03500 What Artificial Intelligence (AI) work are you familiar with?
03600
03700
03800
03900
04000
04100
04200 What topics would you most like to have discussed?
04300